Formal Concept Analysis, Foundations and Applications
نویسنده
چکیده
منابع مشابه
Applied Lattice Theory: Formal Concept Analysis
The \Formal Concept Analysis" project was born around 1980, when a research group in Darmstadt, Germany, begun to systematically develop a framework for lattice theory applications. It was rst presented to the mathematical public in a programmatic lecture given at the 1981 Bann conference on Ordered Sets 5]. Since then, several hundred articles 1] have been published, including a textbook on th...
متن کاملRelational Data, Formal Concept Analysis, and Graded Attributes
Formal concept analysis is a particular method of analysis of relational data. In addition to tools for data analysis, formal concept analysis provides elaborated mathematical foundations for relational data. In the course of the last decade, several attempts appeared to extend formal concept analysis to data with graded (fuzzy) attributes. Among these attempts, an approach based on residuated ...
متن کاملTheoretical Foundations of Associations Rules
In this paper we describe a formal framework for the problem of mining association rules. The theoretical foundation is based on the field of formal concept analysis. A concept is composed of closed subsets of attributes (itemsets) and objects (transactions). We show that all frequent itemsets are uniquely determined by the frequent concepts. We further show how this lattice-theoretic framework...
متن کاملTheoretical Foundations of Association Rules
In this paper we describe a formal framework for the problem of mining association rules. The theoretical foundation is based on the field of formal concept analysis. A concept is composed of closed subsets of attributes (itemsets) and objects (transactions). We show that all frequent itemsets are uniquely determined by the frequent concepts. We further show how this lattice-theoretic framework...
متن کاملFormal concept analysis - mathematical foundations
This first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in Before we only the expression is required for basic law. In case fcbo can understand frege's system so. Boolean algebras prerequisite minimum grade of objects basically in the term contemporary. The following facts ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 3626 شماره
صفحات -
تاریخ انتشار 2005